Secure Determinant Codes for Distributed Storage Systems

The information-theoretic secure exact-repair regenerating codes for distributed storage systems (DSSs) with parameters $(n,k=d,d,\ell)$ are studied in this paper. We consider notation="LaTeX">$n$ nodes, which the original data can be recovered from any subset of notation="LaTeX">$k=d$ and content node retrieved those notation="LaTeX">$d$ helper nodes. Moreover, we two secrecy constraints, namely, Type-I, where message remains against an eavesdropper access to up notation="LaTeX">$\ell $ Type-II, who observe incoming repair all possible nodes a fixed but unknown compromised Two classes determinant proposed Type-I Type-II constraints. Each code designed range per-node capacity bandwidth system parameters. They lead achievable trade-offs, security.